Classifying a message based on likelihood of spoofing

ABSTRACT

A technique for determining a boundary IP address is disclosed. The technique includes processing a header to extract candidate IP address, locating a gateway IP address, and selecting the boundary IP address based on the location of the gateway IP address.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 14/816,900 filed Aug. 3, 2015, issuing as U.S. Pat. No. 9,860,167, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 12/070,164 filed Feb. 15, 2008, now U.S. Pat. No. 9,100,335, which is a divisional and claims the priority benefit of U.S. patent application Ser. No. 10/776,677 filed Feb. 10, 2004, now U.S. Pat. No. 8,856,239, the disclosures of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION Field of the Invention

The present invention relates generally to electronic messages. More specifically, a technique for determining a boundary IP address is disclosed.

Description of Related Art

Electronic messages have become an indispensable part of modem communication. Electronic messages such as email or instant messages are popular because they are fast, easy, and have essentially no incremental cost. Unfortunately, these advantages of electronic messages are also exploited by marketers who regularly send out unsolicited junk messages. The junk messages are referred to as “spam”, and spam senders are referred to as “spammers”. Spam messages are a nuisance to users. They clog email inboxes, waste system resources, often promote distasteful subjects, and sometimes sponsor outright scams.

There are a number of commonly used techniques for classifying messages and identifying spam, such as black listing the sender addresses of known spammers. However, these techniques sometimes misclassify spam messages. For example, a system that performs black listing may be configured to identify any messages with certain sender addresses, such as “john@getrichquick.com” as spam. However, spammers can insert a false sender address into a spam message, enabling the spam message to pass through the black listing filter. Another problem is that spammers may spoof a genuine sender address or domain that has been white listed by a user. It would be useful to have a technique that more accurately classifies messages. Such a technique would not be effective if spammers could easily alter parts of the spam messages they send so that the messages are identified as non-spam. Thus, it would also be desirable if non-spam messages identified by such a technique are not easily spoofed or if such spoofing could be detected.

BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments of the invention are disclosed in the following detailed description and the accompanying drawings.

FIG. 1A is a flowchart illustrating processing a message by a system that includes IP address and domain based classification.

FIG. 1B is a flowchart illustrating a technique for classifying a message based on IP address and domain.

FIG. 2A is a diagram illustrating an email message header.

FIG. 2B is a flowchart illustrating determining the boundary IP address of an email message.

FIG. 3 is a diagram illustrating an example of a reputation table.

FIG. 4 is a flowchart illustrating one possible approach for classifying a message based on an IP address and domain pair.

DETAILED DESCRIPTION

The invention can be implemented in numerous ways, including as a process, an apparatus, a system, a composition of matter, a computer readable medium such as a computer readable storage medium or a computer network wherein program instructions are sent over optical or electronic communication links. In this specification, these implementations, or any other form that the invention may take, may be referred to as techniques. In general, the order of the steps of disclosed processes may be altered within the scope of the invention.

A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. The invention is described in connection with such embodiments, but the invention is not limited to any embodiment. The scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications and equivalents. Numerous specific details are set forth in the following description in order to provide a thorough understanding of the invention. These details are provided for the purpose of example and invention may be practiced according to the claims without some or all of these specific details. For the purpose of clarity, technical material that is known in the technical fields related to the invention has not been described in detail so that the invention is not unnecessarily obscured.

An incoming message can be classified based on one or more IP addresses and a domain (or domain name) associated with the message. In some embodiments, the message is classified based on previous classifications made to an IP address and domain pair. For example, if an IP address and domain pair is associated with a significant number of messages previously classified as spam, the next incoming message associated with that IP address and domain may be classified as spam. Additionally, other classifications of related IP address and domain pairs may inform the classification of a given IP address and domain pair as is described below. A related pair may be a pair with the same domain name but a different IP address or a pair with a different domain name and the same IP address. Accordingly, a particular IP address and domain pair may develop a “reputation” for being associated with spam. This and other techniques for classifying a message based on IP address and domain are described below.

As used herein, a message refers to an email message, an instant message, a text message, and/or any other information transmitted electronically. In the following examples, processing email messages is discussed in detail. The disclosed techniques are also applicable to any other types of messages.

Classifying, as used herein, includes any determination made about a message. This determination can include the type of message, the probability that the message is a particular type of message, or a level of suspiciousness associated with the message. Classifying may include any determination of the nature of a message including determining that it is likely to be spoofed or determining that it is appropriate to override a white list or a black list that controls the disposition of such a message. A message may be determined to be spam, non-spam, or likely to be spam. A message may be considered suspicious because it doesn't appear to come from the domain it is purported to come from.

FIG. 1A is a flowchart illustrating processing a message by a system that includes IP address and domain based classification. In this example, an IP address and domain based classification generates information that can be used as part of an overall classification. An incoming message is received (104). The message is classified based on IP address and domain (116). A typical message header includes an IP address and domain for each hop along the path the message took between the sender and recipient. Any number of these IP addresses and domains can be used to classify the message. In the following examples, classification based on one IP address and domain pair is discussed in detail. In other embodiments, classification is based on multiple IP addresses and domains.

Classifying the message based on an IP address and domain can be done in numerous ways. For example, an IP address and domain pair associated with known friends can be white listed. The message can be classified by consulting a record of previous classifications made to messages with the same IP address and domain. For example, if a user receives messages from a company with domain anycompany.com and the company only sends messages from a particular set of good IP addresses, then over time, the good IP addresses become associated with anycompany.com. It is difficult for a spammer to send a spam message with a forged sender domain of “anycompany.com” which also forges the boundary IP address. Therefore, if anycompany.com is whitelisted, it is very likely that messages purporting to be from anycompany.com originating from the IP addresses that have become associated with anycompany.com should enjoy automatic acceptance as a result of the whitelist. Messages with a sender domain of “anycompany.com” and any other IP address can be treated differently than messages from IP addresses that over time have become associated with anycompany.com. They may be classified as suspicious until enough good messages are received from the new IP address for it to become associated with the domain.

The resulting IP address and domain based classification may be provided as input to other classifiers (120). In general, the IP address and domain classification may work with other classifiers in various manners. It may output information to other classifiers or it may use information from other classifiers as input to its classification process or it may determine whether a classification made by another classifier can be trusted. Any available classifiers can be used, including machine or user based classifiers. For example, the classification can be provided as input to a Bayesian classifier. A white list can be overridden if the IP address and domain based classification provides compelling evidence that the message was not really sent from the stated sender domain. Further examples of this are described below.

Basing a classification on an IP address and domain associated with the message forces spammers to forge both the IP address and domain, which may be difficult if not impossible, depending on the network configuration. Furthermore, the spammer must forge the same IP address and domain extracted by the classifier for classification.

FIG. 1B is a flowchart illustrating a technique for classifying a message based on IP address and domain. This flowchart provides further details of step 116 in FIG. 1A. In this example, an IP address associated with a message is selected (130). A message is typically associated with more than one IP address, as shown in FIG. 2A. FIGS. 2A and 2B are discussed in detail for explanatory purposes before returning to FIG. 1B.

FIG. 2A is a diagram illustrating an email message header 200. A typical message header includes an IP address and domain for each hop along the path the message took between the sender and recipient. For example, email header 200 shows that the message was last received from IP address 204 (10.1.1.4 with domain alpine.corp.mailfronther.com). Prior to that, it was received from IP address 208 (216.218.255.139 with domain yoyodyne.heyx.com), and so on. An IP address from this chain should be selected for the IP address and domain pair. For example, the stated originating IP address 202 (126.123.117.239 with domain bigfoot.com) could be selected. However, the selected IP address is preferably the boundary IP address.

Typically, the boundary IP address is the IP address one hop below the gateway IP address in the chain of IP addresses shown in the header. The boundary IP address can also be selected to be more than one hop below the gateway IP address. For example, in message header 200, IP address 208 belongs to a known gateway within the user's network. IP address 216 (24.128.150.127 with domain h0010dc3baf84.ne.client2.attbi.com with IP address) is one hop from the gateway just outside the user's local network. In this example, IP address 216 is the boundary IP address.

In FIG. 2A, boundary line 220 divides designated trusted IP addresses from distrusted IP addresses. Those IP addresses in the chain above boundary line 220 are designated as trusted. These IP addresses, with the exception of the boundary IP address itself, are internal to the user's network. Those IP addresses in the chain below boundary line 220 are designated as distrusted because they are outside of the user's network. This trust typically weakens moving down the chain because it becomes easier to forge IP addresses. Thus, the boundary IP address can be considered the most trusted IP address outside the user's local network.

There are numerous ways in which the boundary IP address can be determined. The boundary IP address can be learned or preconfigured. For example, the boundary IP address can be learned by detecting a pattern after a certain number of messages are received. The boundary IP address can be adaptively determined. The boundary IP address can also be preconfigured. For example, the user may already know the number of hops to the gateway. Once the gateway is found within the message, the boundary IP address can be defined to be an appropriate number of hops away from the gateway IP address. In some embodiments, the system may check for consistency between the user preconfigured gateway IP address and whether that IP address actually appears to belong to the gateway. In some embodiments, the technique shown in FIG. 2B is used to determine the boundary IP address.

FIG. 2B is a flowchart illustrating determining the boundary IP address of an email message. In this example, the header is first processed to extract the IP addresses and domains (230). The top level domain and IP addresses (in brackets) can be extracted from each “Received: from” line and placed in an array. For example, the array of IP addresses and domains for header 200 can be as follows: [0029] Received_Chain[0]=alpine.corp.mailfrontier.com (alpine [10.1.1.4]) [0030] Received_Chain[1]=yoyodyne.heyx.com ([216.218.255.139]) [0031] Received_Chain[2]=h0010dc3baf84.ne.client2.attbi.com (h0010dc3baf84.ne.client2.attbi.com [24.128.150.127])] [0032] Received_Chain[3]=bigfoot.com [126.123.117.239] [0033] where Received_Chain is the array of IP addresses and domains.

The gateway IP address is then located (234). In this example, the gateway IP address is a known IP address within the user's network. For example, in header 200, IP address 208 is located in Received_Chain[I]. Any appropriate method for finding a known value within an array may be used. For example, a simple march down the array can be performed, with a comparison performed at each step. The boundary IP address is then selected based on the location of the gateway IP address (238). For example, the IP address after the gateway address can be selected as the boundary IP address. In the case of header 200, the boundary IP would then be Received_Chain[2]. If a gateway IP address is not located, the last IP address can be designated the boundary IP address.

There are numerous other techniques that can be used to determine the boundary IP address of an email message. For example, in addition to considering the IP addresses that a message traverses, reverse domain information can be considered. As long as the reverse domain information indicates that the domain is the same, then the domain and associated IP address can be considered trusted.

Referring further to FIG. 1B, in addition to an IP address, a domain associated with the message is selected (134). Any domain associated with the message can be selected. A domain can include a full email address. Preferably, the domain is the stated sender domain. In message header 200, sender address 224 is shown to be “martin.williams@anybank.net”. Therefore, the stated sender domain in this message is “anybank.net”.

Once an appropriate IP address and domain are selected, they can be looked up (138) in a reputation table. The reputation table can be stored in any appropriate form, such as in a database or spreadsheet. The reputation table includes information about previous classifications made to various IP address and domain pairs. In some embodiments, the reputation table can be implemented as shown in FIG. 3.

FIG. 3 is a diagram illustrating an example of a reputation table 300. Each cell is indexed by a domain and an IP address. Each cell stores information that can be used to make a determination about messages associated with that IP address and domain pair. In some embodiments, information is stored in the form of classification variables. For example, a classification variable could include a count of previous classifications made to the IP address and domain pair. In table 300, the following classification variables are shown:

user_classified_spam is a count of the number of messages classified as spam by the user. For example, if a user moves a message from an inbox to a junk folder, user_classified_spam is incremented.

user_classified_good is a count of the number of messages classified as good by the user. For example, if a user moves a message from a junk folder to an inbox, user_classified_good is incremented.

machine_classified_spam is a count of the number of messages classified as spam by a machine.

machine_classified_good is a count of the number of messages classified as good by a machine.

time_stamp indicates the time at which the last message was received.

It should be noted that the variables shown in this example are just one example of the many types of information that can be stored in a cell. The information stored in the cell can come from many sources, such as probe accounts or a user junking (moving a message from an inbox to a junk folder) or unjunking (moving a message from a junk folder to an inbox) a message.

Referring back to the example, when an incoming message is classified by a user, the cell corresponding to the stated sender domain and boundary IP address of the message is accessed. If the message is classified as good, user_classified_good is incremented, and if the message is classified as spam, user_classified_spam is incremented. Time_stamp is also updated to indicate the time the incoming message was received. Likewise, if the incoming message is classified by a machine, machine_classified_spam or machine_classified_good are updated similarly. Thus, a reputation table can be constructed and maintained to reflect previous classifications of received messages.

In some embodiments, when an incoming message is classified as indeterminate (for example, the probability that the message is spam is 0.4-0.6), and there is no subsequent spam classification by the user (e.g., the user does not junk the message), user_classified_good is incremented by a fractional amount. For example, user_classified_good can be incremented by 1/10.

In some embodiments, the classification variables are decayed over time to reduce the effects of older classifications. Older classifications may be considered less reliable due to changes that may occur over time. The classification variables can be decayed just prior to incrementing a classification variable, at periodic intervals, or at any other time. Decaying the classification variables can be performed in various ways. For example, a linear or exponential decay can be performed.

Referring further to FIG. 1B, once an appropriate IP address and domain are selected and they are accessed in a reputation table, the message is classified based on the IP address and domain pair (144). There are many ways in which the classification can be performed. For example, the classification can be performed by forming a score based on the classification variables. In some embodiments, the score is a ratio of spam classifications to good classifications. A spam ratio can be formed as follows:

spam_ratio=(user_classified_spam+machine_classified_spam+1)/(user_classified_good+machine_classified_good+1)  (Equation 1)

The classification variables can also be decayed with time, in which case the spam_ratio becomes an estimated instantaneous spam ratio.

Since a user's decisions are typically the most reliable classification, the machine classification is given less weight in some embodiments. In this case, a spam ratio can be formed as follows:

spam_ratio=(user_classified_spam+weight*machine_classified_spam+1)/(user_classified_good+weight*machine_classified_good+1)  (Equation 2)

where

0<weight<1

For example, if weight= 1/10, the machine based classifications have 1/10 of the effect of the user based classifications. The weight is not necessarily the same in all cells.

Once the spam ratio is determined, a classification can be made based on the ratio. A spam ratio is just one of many possible scores that can be used. For example, a spam rate can also be used, where:

spam_rate=(user_classified_spam+machine_classified_spam+1)/(user_classified_good+machine_classified_good+user_classified_spam+machine_classified_spam+1)

These techniques may be used to classify messages for an individual user or a group of users. In some embodiments, the users share a classifier that is updated when a message is classified. For example, a global reputation table can be stored on a server and updated and accessed by a plurality of users and machines on a local area network. In some embodiments, the users have their own message classifiers. When a message is classified, the message classifiers of the individual users are updated.

The information in the reputation table can be used in numerous ways to classify a message. For example, information in different cells may be compared and used to classify a message that corresponds to a cell. Information from the row or column associated with the cell can be used. For example, if a message arrives with the domain “shoppingdomain.com”, scores for the entire row corresponding to “shoppingdomain.com” may indicate spam in most or all cells in the row, indicating that many users have received what they consider to be spam from that domain. If the cell corresponding to an incoming message indicates spam but the user has the domain white listed, the white list should override the community classification because common spam classification among most of the IP addresses associated with the domain is an indication that the domain is not being spoofed by the current IP address. More likely, the case is that the user has whitelisted a domain that most users consider to be sending spam. That is, most users on the network have classified messages from “shoppingdomain.com” as junk in the past, but this particular user actually wants to receive messages from “shoppingdomain.com”.

In another example, assume that “bigcompanydomain.com” belongs to a big company that frequently sends good messages. However, “bigcompanydomain.com” is also often forged by spammers. Over time, certain cells in the row will gain a good reputation. These cells correspond to legitimate IP addresses associated with “bigcompanydomain.com”. If a message arrives that falls into another cell in that row, that message may be classified as spam even if the user has that domain white listed, because of the strong evidence that that IP address is not a legitimate one.

FIG. 4 is a flowchart illustrating one possible approach for classifying a message based on an IP address and domain pair. In this example, initially, a score is determined for the domain and IP address pair (404). In some embodiments, the score is a spam ratio. Accordingly, the cell corresponding to the domain and IP address is accessed, and the classification variables within that cell are used to calculate a spam ratio according to Equation 1 or Equation 2. It is determined whether the message is spam (408) based on the calculated spam ratio. The message is then classified as good (432) or spam (434). If there is not enough information available, the message remains unclassified.

If the message remains unclassified, a score is then determined for the IP address (412). If the score is a spam ratio, the column corresponding to the IP address is accessed, and the classification variables within those cells are combined to calculate a spam ratio for that IP address. For example, a spam ratio for an IP address can be calculated as follows:

spam_ratio=(.SIGMA.user_classified_spam+.SIGMA.machine_classified_spam+1−)/(SIGMA.user_classified_good+.SIGMA.machine_classified_good+1)  (Equation 3)

where the summations are over the column corresponding to the IP address.

In embodiments where machine classifications are given less weight than user classifications, a spam ratio can be formed as follows:

spam_ratio=(.SIGMA.user_classified_spam+weight*.SIGMA.machine_classified_spam+1)/(SIGMA.user_classified_good+weight*.SIGMA.machine_classified_goo−d+1)

where

0<weight<1

There are numerous other ways in which the classification variables can be combined. For example, the spam ratio for an IP address can be calculated by averaging the spam ratios of each cell in the column corresponding to that IP address.

It is determined whether the message is spam (416) based on the calculated spam ratio for the IP address. The message is then classified as good (432) or spam (434). If there is not enough information available, the message remains unclassified.

If the message remains unclassified, a score is then determined for the domain (420). If the score is a spam ratio, the row corresponding to the domain is accessed, and the classification variables within those cells are combined to calculate a spam ratio for that domain. There are numerous ways in which the classification variables can be combined. For example, a spam ratio for a domain can be calculated as shown in Equation 3 or Equation 4, only the summations are over the row corresponding to the domain. Alternatively, the spam ratio for a domain can be calculated by averaging the spam ratios of each cell in the row corresponding to that domain.

It is determined whether the message is spam (424) based on the calculated spam ratio for the IP address. The message is then classified as good (432) or spam (434). If there is not enough information available, the message remains unclassified. Finally, if the message remains unclassified, other classification techniques can be attempted (428).

The steps shown in this example can be performed in any order. In this example, the score for the IP address is shown to be checked (412) before the score for the domain name is checked (420). This is because an IP address is typically a stronger indicator of spam. It may be desirable, however, to swap step 412 with step 420. For example, if a legitimate sender has developed a good reputation with a particular domain and switches email servers, his IP address changes, but his domain remains the same. If the score for the domain is checked first, it can be determined sooner that the message is good.

In a more specific example, assume that a user's bank “Good Bank” sends periodic bank statements to the user from an email address “statements@goodbank.com” with an IP address “123.456.789”. Over time, that IP address and domain pair (123.456.789, goodbank.com) gain a good reputation. If Good Bank changes its email server, the IP address will change and the reputation of that IP address and domain pair is initially lost. However, if the score for the domain “goodbank.com” is determined, its good reputation should remain in most cases. Thus, it may be desirable to classify based on the domain (420) before classifying based on the IP address (412).

Although the foregoing embodiments have been described in some detail for purposes of clarity of understanding, the invention is not limited to the details provided. There are many alternative ways of implementing the invention. The disclosed embodiments are illustrative and not restrictive. 

1. (canceled)
 2. A method for classifying messages, the method comprising: receiving an electronic message; identifying an addresses and a domain associated with the electronic message; comparing the identified address and the domain associated with the electronic message with a set of information that cross references at least one of address information or domain information with a good status; identifying that the received electronic message is a good message based at least in part on the comparison of the identified on or more addresses and the domain associated with the electronic message with the set of information that cross references the at least one of the address information or the domain information with the good status; and allowing the electronic message to be sent to a destination based on the at least one of the address information or the domain information with the good status.
 3. The method of claim 2, further comprising: identifying that the identified address does not correspond to a known good address and that the identified domain corresponds to a known good domain; and classifying the electronic message as good based on the identified domain corresponding to the known good domain and based on a preference that allows the domain information to supersede the address information.
 4. The method of claim 2, further comprising: classifying an address and a domain associated with a known electronic message sender, wherein the identified address and the identified domain correspond to the address and domain associated with the known electronic message sender; and storing the address and the domain associated with the known electronic message sender in a table that stores the set of information that cross references the at least one of the address information or the domain information with the good status.
 5. The method of claim 4, wherein the address and the domain associated with a known electronic message sender are associated with a boundary of a computer network.
 6. The method of claim 2, further comprising: receiving one or more message from a first address and a first domain; classifying the one or more messages from the first address and the first domain with a bad status when the first address and the first domain have not previously been associated with the good status; receiving an indication that the first address and the first domain are now associated with the good status; receiving a subsequent message from the first address and the first domain; identifying that the subsequent message is associated with the good status; and allowing the subsequent message to be sent to a recipient based on the indication associating the first address and the first domain with the good status.
 7. The method of claim 6, further comprising receiving information from one or more users indicating that the one or more received messages correspond to the good status, wherein the indication is received based on the information received from the one or more users.
 8. The method of claim 2, wherein the information that cross references the at least one of the address information or the domain information with the good status is based on data from a plurality of classifiers including machine classifiers and user classification information.
 9. The method of claim 2, wherein the good status is based on a calculation that compares a ratio of bad classifiers with good classifiers.
 10. The method of claim 2, wherein the set of information that cross references the at least one of the address information or the domain information with the good status is stored in a table that cross references good internet protocol (IP) addresses with good domains.
 11. A non-transitory computer readable storage medium having embodied thereon a program executable by a processor to perform a method for classifying messages, the method comprising: receiving an electronic message; identifying an addresses and a domain associated with the electronic message; comparing the identified address and the domain associated with the electronic message with a set of information that cross references at least one of address information or domain information with a good status; identifying that the received electronic message is a good message based at least in part on the comparison of the identified on or more addresses and the domain associated with the electronic message with the set of information that cross references the at least one of the address information or the domain information with the good status; and allowing the electronic message to be sent to a destination based on the at least one of the address information or the domain information with the good status.
 12. The non-transitory computer readable storage medium of claim 2, the program further executable to: identify that the identified address does not correspond to a known good address and that the identified domain corresponds to a known good domain; and classify the electronic message as good based on the identified domain corresponding to the known good domain and based on a preference that allows the domain information to supersede the address information.
 13. The non-transitory computer readable storage medium of claim 2, the program further executable to: classify an address and a domain associated with a known electronic message sender, wherein the identified address and the identified domain correspond to the address and domain associated with the known electronic message sender; and store the address and the domain associated with the known electronic message sender in a table that stores the set of information that cross references the at least one of the address information or the domain information with the good status.
 14. The non-transitory computer readable storage medium of claim 13, wherein the address and the domain associated with a known electronic message sender are associated with a boundary of a computer network.
 15. The non-transitory computer readable storage medium of claim 11, the program further executable to: receive one or more message from a first address and a first domain; classify the one or more messages from the first address and the first domain with a bad status when the first address and the first domain have not previously been associated with the good status; receive an indication that the first address and the first domain are now associated with the good status; receive a subsequent message from the first address and the first domain; identify that the subsequent message is associated with the good status; and allow the subsequent message to be sent to a recipient based on the indication associating the first address and the first domain with the good status.
 16. The non-transitory computer readable storage medium of claim 15, the program further executable to receive information from one or more users indicating that the one or more received messages correspond to the good status, wherein the indication is received based on the information received from the one or more users.
 17. The non-transitory computer readable storage medium of claim 11, wherein the information that cross references the at least one of the address information or the domain information with the good status is based on data from a plurality of classifiers including machine classifiers and user classification information.
 18. The non-transitory computer readable storage medium of claim 2, wherein the good status is based on a calculation that compares a ratio of bad classifiers with good classifiers.
 19. The non-transitory computer readable storage medium of claim 2, wherein the set of information that cross references the at least one of the address information or the domain information with the good status is stored in a table that cross references good internet protocol (IP) addresses with good domains.
 20. An apparatus for classifying messages, the apparatus comprising: a network interface that receives an electronic message; a memory; and a processor that executes instructions out of the memory to: identify an addresses and a domain associated with the electronic message, compare the identified address and the domain associated with the electronic message with a set of information that cross references at least one of address information or domain information with a good status, identify that the received electronic message is a good message based at least in part on the comparison of the identified on or more addresses and the domain associated with the electronic message with the set of information that cross references the at least one of the address information or the domain information with the good status, and allow the electronic message to be sent to a destination based on the at least one of the address information or the domain information with the good status.
 21. The apparatus of claim 20 wherein: the identified address is identified as not corresponding to a known good address and that the identified domain corresponds to a known good domain, and the electronic message is classified as good based on the identified domain corresponding to the known good domain and based on a preference that allows the domain information to supersede the address information. 